Monotonicity, asymptotic normality and vertex degrees in random graphs
نویسندگان
چکیده
منابع مشابه
Monotonicity, asymptotic normality and vertex degrees in random graphs
We exploit a result by Nerman [23] which shows that conditional limit theorems hold when a certain monotonicity condition is satisfied. Our main result is an application to vertex degrees in random graphs where we obtain asymptotic normality for the number of vertices with a given degree in the random graph G(n, m) with a fixed number of edges from the corresponding result for the random graph ...
متن کاملRandom graphs with forbidden vertex degrees
We study the random graph Gn,λ/n conditioned on the event that all vertex degrees lie in some given subset S of the nonnegative integers. Subject to a certain hypothesis on S , the empirical distribution of the vertex degrees is asymptotically Poisson with some parameter b μ given as the root of a certain ‘characteristic equation’ of S that maximizes a certain function ψS(μ). Subject to a hypot...
متن کاملASYMPTOTIC NORMALITY OF THE k-CORE IN RANDOM GRAPHS
We study the k-core of a random (multi)graph on n vertices with a given degree sequence. In our previous paper [18] we used properties of empirical distributions of independent random variables to give a simple proof of the fact that the size of the giant k-core obeys a law of large numbers as n → ∞. Here we develop the method further and show that the fluctuations around the deterministic limi...
متن کاملAsymptotic Normality of the K - Core in Random Graphs 3
We study the k-core of a random (multi)graph on n vertices with a given degree sequence. In our previous paper [Random Structures Algorithms 30 (2007) 50–62] we used properties of empirical distributions of independent random variables to give a simple proof of the fact that the size of the giant k-core obeys a law of large numbers as n →∞. Here we develop the method further and show that the f...
متن کاملOn Percolation in Random Graphs with given Vertex Degrees
We study the random graph obtained by random deletion of vertices or edges from a random graph with given vertex degrees. A simple trick of exploding vertices instead of deleting them, enables us to derive results from known results for random graphs with given vertex degrees. This is used to study existence of giant component and existence of k-core. As a variation of the latter, we study also...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bernoulli
سال: 2007
ISSN: 1350-7265
DOI: 10.3150/07-bej6103